SherbyNet - /page/wikibook/entry.mu

<!DOCTYPE html>

<title>Array processing</title>

</head>

Array processing

</h1>

</header>

/* start https://en.wikipedia.org/ */

.mw-parser-output .hatnote{font-style:italic}.mw-parser-output div.hatnote{padding-left:1.6em;margin-bottom:0.5em}.mw-parser-output .hatnote i{font-style:normal}.mw-parser-output .hatnote+link+.hatnote{margin-top:-0.5em}@media print{body.ns-0 .mw-parser-output .hatnote{display:none!important}}

/* end https://en.wikipedia.org/ */

</style><div role="note" class="hatnote navigation-not-searchable">Not to be confused with <a href="Array_processor" class="mw-redirect" title="Array processor">Array processor</a> or <a href="Array_data_structure" class="mw-redirect" title="Array data structure">Array data structure</a>.</div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .ambox{border:1px solid #a2a9b1;border-left:10px solid #36c;background-color:#fbfbfb;box-sizing:border-box}.mw-parser-output .ambox+link+.ambox,.mw-parser-output .ambox+link+style+.ambox,.mw-parser-output .ambox+link+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+style+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+link+.ambox{margin-top:-1px}html body.mediawiki .mw-parser-output .ambox.mbox-small-left{margin:4px 1em 4px 0;overflow:hidden;width:238px;border-collapse:collapse;font-size:88%;line-height:1.25em}.mw-parser-output .ambox-speedy{border-left:10px solid #b32424;background-color:#fee7e6}.mw-parser-output .ambox-delete{border-left:10px solid #b32424}.mw-parser-output .ambox-content{border-left:10px solid #f28500}.mw-parser-output .ambox-style{border-left:10px solid #fc3}.mw-parser-output .ambox-move{border-left:10px solid #9932cc}.mw-parser-output .ambox-protection{border-left:10px solid #a2a9b1}.mw-parser-output .ambox .mbox-text{border:none;padding:0.25em 0.5em;width:100%}.mw-parser-output .ambox .mbox-image{border:none;padding:2px 0 2px 0.5em;text-align:center}.mw-parser-output .ambox .mbox-imageright{border:none;padding:2px 0.5em 2px 0;text-align:center}.mw-parser-output .ambox .mbox-empty-cell{border:none;padding:0;width:1px}.mw-parser-output .ambox .mbox-image-div{width:52px}@media(min-width:720px){.mw-parser-output .ambox{margin:0 10%}}@media print{body.ns-0 .mw-parser-output .ambox{display:none!important}}

/* end https://en.wikipedia.org/ */

</style>

Array processing is a wide area of research in the field of <a href="Signal_processing" title="Signal processing">signal processing</a> that extends from the simplest form of 1 dimensional line arrays to 2 and 3 dimensional array geometries. Array structure can be defined as a set of <a href="Sensor" title="Sensor">sensors</a> that are spatially separated, e.g. <a href="Antenna_(radio)" title="Antenna (radio)">radio antenna</a> and <a href="Seismic_array" title="Seismic array">seismic arrays</a>. The sensors used for a specific problem may vary widely, for example <a href="Microphone" title="Microphone">microphones</a>, <a href="Accelerometer" title="Accelerometer">accelerometers</a> and <a href="Telescope" title="Telescope">telescopes</a>. However, many similarities exist, the most fundamental of which may be an assumption of <a href="Wave_propagation" class="mw-redirect" title="Wave propagation">wave propagation</a>. Wave propagation means there is a systemic relationship between the signal received on spatially separated sensors. By creating a physical model of the wave propagation, or in <a href="Machine_learning" title="Machine learning">machine learning</a> applications a <a href="Training_data" class="mw-redirect" title="Training data">training data</a> set, the relationships between the signals received on spatially separated sensors can be leveraged for many applications.

Some common problem that are solved with array processing techniques are:

<ul><li>determine number and locations of energy-radiating sources</li>

<li>enhance the signal to noise ratio (<a href="Signal-to-noise_ratio" title="Signal-to-noise ratio">SNR</a>) or "<a href="SINR" class="mw-redirect" title="SINR">signal-to-interference-plus-noise ratio (SINR)</a>"</li>

<li>track moving sources</li></ul>

Array processing metrics are often assessed in noisy environments. The model for noise may be either one of spatially incoherent noise, or one with interfering signals following the same propagation physics. <a href="Estimation_theory" title="Estimation theory">Estimation theory</a> is an important and basic part of signal processing field, which used to deal with estimation problem in which the values of several parameters of the system should be estimated based on measured/empirical data that has a random component. As the number of applications increases, estimating temporal and spatial parameters become more important. Array processing emerged in the last few decades as an active area and was centered on the ability of using and combining data from different sensors (antennas) in order to deal with specific estimation task (spatial and temporal processing). In addition to the information that can be extracted from the collected data the framework uses the advantage prior knowledge about the geometry of the <a href="Sensor_array" title="Sensor array">sensor array</a> to perform the estimation task.

Array processing is used in <a href="Radar" title="Radar">radar</a>, <a href="Sonar" title="Sonar">sonar</a>, seismic exploration, anti-jamming and <a href="Wireless" title="Wireless">wireless</a> communications. One of the main advantages of using array processing along with an array of sensors is a smaller foot-print. The problems associated with array processing include the number of sources used, their <a href="Direction_of_arrival" title="Direction of arrival">direction of arrivals</a>, and their signal <a href="Waveforms" class="mw-redirect" title="Waveforms">waveforms</a>.<a href="#cite_note-utexas1-1">[1]</a><a href="#cite_note-ref1-2">[2]</a><a href="#cite_note-ref2-3">[3]</a><a href="#cite_note-ref3-4">[4]</a>

There are four assumptions in array processing. The first assumption is that there is uniform propagation in all directions of isotropic and non-dispersive medium. The second assumption is that for far field array processing, the radius of propagation is much greater than size of the array and that there is <a href="Plane_wave" title="Plane wave">plane wave</a> propagation. The third assumption is that there is a zero mean white noise and signal, which shows uncorrelation. Finally, the last assumption is that there is no coupling and the calibration is perfect.<a href="#cite_note-utexas1-1">[1]</a>

<div class="mw-heading mw-heading2"><h2 id="Applications">Applications</h2></div>

The ultimate goal of sensor array signal processing is to estimate the values of parameters by using available temporal and spatial information, collected through sampling a wavefield with a set of antennas that have a precise geometry description. The processing of the captured data and information is done under the assumption that the wavefield is generated by a finite number of signal sources (emitters), and contains information about signal parameters characterizing and describing the sources. There are many applications related to the above problem formulation, where the number of sources, their directions and locations should be specified. To motivate the reader, some of the most important applications related to array processing will be discussed.

<ul><li>Radar and Sonar Systems:</li></ul>

array processing concept was closely linked to radar and sonar systems which represent the classical applications of array processing. The antenna array is used in these systems to determine location(s) of source(s), cancel interference, suppress ground clutter. <a href="Radar" title="Radar">Radar systems</a> used basically to detect objects by using radio waves. The range, altitude, speed and direction of objects can be specified. Radar systems started as military equipments then entered the civilian world. In radar applications, different modes can be used, one of these modes is the active mode. In this mode the antenna array based system radiates pulses and listens for the returns. By using the returns, the estimation of parameters such as velocity, range and DOAs (direction of arrival) of target of interest become possible. Using the passive far-field listening arrays, only the DOAs can be estimated. <a href="Sonar" title="Sonar">Sonar systems</a> (Sound Navigation and Ranging) use the sound waves that propagate under the water to detect objects on or under the water surface. Two types of sonar systems can be defined the active one and the passive one. In active sonar, the system emits pulses of sound and listens to the returns that will be used to estimate parameters. In the passive sonar, the system is essentially listening for the sounds made by the target objects. There is a difference between the radar system that uses radio waves and the sonar system that uses sound waves, the reason why the sonar uses the sound wave is because sound waves travel farther in the water than do radar and light waves. In passive sonar, the receiving array has the capability of detecting distant objects and their locations. Deformable array are usually used in sonar systems where the antenna is typically drawn under the water. In active sonar, the sonar system emits sound waves (acoustic energy) then listening and monitoring any existing echo (the reflected waves). The reflected sound waves can be used to estimate parameters, such as velocity, position and direction etc. Difficulties and limitations in sonar systems comparing to radar systems emerged from the fact that the propagation speed of sound waves under the water is slower than the radio waves. Another source of limitation is the high propagation losses and scattering. Despite all these limitations and difficulties, sonar system remains a reliable technique for range, distance, position and other parameters estimation for underwater applications.<a href="#cite_note-ref2-3">[3]</a><a href="#cite_note-ref6-5">[5]</a>

NORSAR is an independent geo-scientific research facility that was founded in Norway in 1968. NORSAR has been working with array processing ever since to measure seismic activity around the globe.<a href="#cite_note-NORSAR-6">[6]</a> They are currently working on an International Monitoring System which will comprise 50 primary and 120 auxiliary seismic stations around the world. NORSAR has ongoing work to improve array processing to improve monitoring of seismic activity not only in Norway but around the globe.<a href="#cite_note-7">[7]</a>

<ul><li>Communications (wireless)</li></ul>

<a href="Communication_theory" title="Communication theory">Communication</a> can be defined as the process of exchanging of information between two or more parties. The last two decades witnessed a rapid growth of wireless communication systems. This success is a result of advances in communication theory and low power dissipation design process. In general, communication (telecommunication) can be done by technological means through either electrical signals (wired communication) or electromagnetic waves (wireless communication). Antenna arrays have emerged as a support technology to increase the usage efficiency of spectral and enhance the accuracy of wireless communication systems by utilizing spatial dimension in addition to the classical time and frequency dimensions. Array processing and estimation techniques have been used in wireless communication. During the last decade these techniques were re-explored as ideal candidates to be the solution for numerous problems in wireless communication. In wireless communication, problems that affect quality and performance of the system may come from different sources. The multiuser –medium multiple access- and multipath -signal propagation over multiple scattering paths in wireless channels- communication model is one of the most widespread communication models in wireless communication (mobile communication).

In the case of multiuser communication environment, the existence of multiuser increases the inter-user interference possibility that can affect quality and performance of the system adversely. In mobile communication systems the multipath problem is one of the basic problems that base stations have to deal with. Base stations have been using spatial diversity for combating fading due to the severe multipath. Base stations use an antenna array of several elements to achieve higher selectivity, so called <a href="Beamforming" title="Beamforming">beamforming</a>. Receiving array can be directed in the direction of one user at a time, while avoiding the interference from other users.

<ul><li>Medical applications</li></ul>

Array processing techniques got on much attention from medical and industrial applications. In medical applications, the medical image processing field was one of the basic fields that use array processing. Other medical applications that use array processing: diseases treatment, tracking waveforms that have information about the condition of internal organs e.g. the heart, localizing and analyzing brain activity by using bio-magnetic sensor arrays.<a href="#cite_note-ref5-8">[8]</a>

<ul><li>Array Processing for Speech Enhancement</li></ul>

Speech enhancement and processing represents another field that has been affected by the new era of array processing. Most of the acoustic front end systems became fully automatic systems (e.g. telephones). However, the operational environment of these systems contains a mix of other acoustic sources; external noises as well as acoustic couplings of loudspeaker signals overwhelm and attenuate the desired speech signal. In addition to these external sources, the strength of the desired signal is reduced due to the relatively distance between speaker and microphones. Array processing techniques have opened new opportunities in speech processing to attenuate noise and echo without degrading the quality of and affecting adversely the speech signal. In general array processing techniques can be used in speech processing to reduce the computing power (number of computations) and enhance the quality of the system (the performance). Representing the signal as a sum of sub-bands and adapting cancellation filters for the sub-band signals can reduce the demanded computation power and lead to a higher performance system. Relying on multiple input channels allows designing systems of higher quality comparing to systems that use single channel and solving problems such as source localization, tracking and separation, which cannot be achieved in case of using single channel.<a href="#cite_note-9">[9]</a>

<ul><li>Array Processing in Astronomy Applications</li></ul>

Astronomical environment contains a mix of external signals and noises that affect the quality of the desired signals. Most of the arrays processing applications in astronomy are related to image processing. The array used to achieve a higher quality that is not achievable by using a single channel. The high image quality facilitates quantitative analysis and comparison with images at other wavelengths. In general, astronomy arrays can be divided into two classes: the beamforming class and the correlation class. Beamforming is a signal processing techniques that produce summed array beams from a direction of interest – used basically in directional signal transmission or reception- the basic idea is to combine elements in a phased array such that some signals experience destructive inference and other experience constructive inference. Correlation arrays provide images over the entire single-element primary beam pattern, computed off-line from records of all the possible correlations between the antennas, pairwise.

<ul><li>Other applications</li></ul>

In addition to these applications, many applications have been developed based on array processing techniques: Acoustic Beamforming for Hearing Aid Applications, Under-determined Blind Source Separation Using Acoustic Arrays, Digital 3D/4D Ultrasound Imaging Array, Smart Antennas, Synthetic aperture radar, underwater acoustic imaging, and Chemical sensor arrays...etc.<a href="#cite_note-ref2-3">[3]</a><a href="#cite_note-ref3-4">[4]</a><a href="#cite_note-ref6-5">[5]</a>

<div class="mw-heading mw-heading2"><h2 id="General_model_and_problem_formulation">General model and problem formulation</h2></div>

Consider a system that consists of array of r arbitrary sensors that have arbitrary locations and arbitrary directions (directional characteristics) which receive signals that generated by q narrow band sources of known center frequency ω and locations θ1, θ2, θ3, θ4 ... θq. since the signals are narrow band the <a href="Propagation_delay" title="Propagation delay">propagation delay</a> across the array is much smaller than the reciprocal of the signal bandwidth and it follows that by using a complex envelop representation the array output can be expressed (by the sense of superposition) as :<a href="#cite_note-ref2-3">[3]</a><a href="#cite_note-ref6-5">[5]</a><a href="#cite_note-ref5-8">[8]</a>

</mrow>

</mrow>

</munderover>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle x(t)=\sum _{K=1}^{q}a(\theta _{k})s_{k}(t)+n(t)}</annotation>

</semantics>

</math><img src="./518c1e38d9f0213bd698f1885298418897fb6ef6.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -1.005ex; width:30.642ex; height:3.176ex;" alt="{\displaystyle \textstyle x(t)=\sum _{K=1}^{q}a(\theta _{k})s_{k}(t)+n(t)}" loading="lazy">

Where:

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle x(t)}</annotation>

</semantics>

</math><img src="./d54c275db3a1e620737b58e143b0818107fa5f5c.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:3.979ex; height:2.843ex;" alt="{\displaystyle x(t)}" loading="lazy"> is the vector of the signals received by the array sensors,</li>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle s_{k}(t)}</annotation>

</semantics>

</math><img src="./5a3fa6b5e8e74cf5c4e3218b38f671c26ae1215d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:4.828ex; height:2.843ex;" alt="{\displaystyle s_{k}(t)}" loading="lazy"> is the signal emitted by the kth source as received at the frequency sensor 1 of the array,</li>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle a(\theta _{k})}</annotation>

</semantics>

</math><img src="./eb410f28cda31913817ec8c26b310c8f7a6805ea.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:5.218ex; height:2.843ex;" alt="{\displaystyle a(\theta _{k})}" loading="lazy"> is the steering vector of the array toward direction (<math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \theta _{k}}">

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \theta _{k}}</annotation>

</semantics>

</math><img src="./4ae772f574aa637900f7673f6f934bdcf35969ec.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.179ex; height:2.509ex;" alt="{\displaystyle \theta _{k}}" loading="lazy">),</li>

<li>τi(θk): is the propagation delay between the first and the ith sensor for a waveform coming from direction (θk),</li>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle n(t)}</annotation>

</semantics>

</math><img src="./c405f3e8a5e549ba2d9cfe4dc76faded806c2b53.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:4.044ex; height:2.843ex;" alt="{\displaystyle n(t)}" loading="lazy"> is the noise vector.</li></ul>

The same equation can be also expressed in the form of vectors:

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle \mathbf {x} (t)=A(\theta )s(t)+n(t)}</annotation>

</semantics>

</math><img src="./06d3ae6b234a9a215930a88b55446df304213a4e.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:22.425ex; height:2.843ex;" alt="{\displaystyle \textstyle \mathbf {x} (t)=A(\theta )s(t)+n(t)}" loading="lazy">

If we assume now that M snapshots are taken at time instants t1, t2 ... tM, the data can be expressed as:

</mrow>

</mrow>

</mrow>

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {X} =\mathbf {A} (\theta )\mathbf {S} +\mathbf {N} }</annotation>

</semantics>

</math><img src="./42c3dab06f0e8e587d71deb4d16b9fd809120a1a.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:16.454ex; height:2.843ex;" alt="{\displaystyle \mathbf {X} =\mathbf {A} (\theta )\mathbf {S} +\mathbf {N} }" loading="lazy">

Where X and N are the r × M matrices and S is q × M:

</mrow>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {X} =[x(t_{1}),......,x(t_{M})]}</annotation>

</semantics>

</math><img src="./756593fa7cbe002a76a367ae11c8e5338b7916ea.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:25.654ex; height:2.843ex;" alt="{\displaystyle \mathbf {X} =[x(t_{1}),......,x(t_{M})]}" loading="lazy">

</mrow>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {N} =[n(t_{1}),......,n(t_{M})]}</annotation>

</semantics>

</math><img src="./ac8579f7d077eaacd66eff741df7533d27b817c4.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:25.856ex; height:2.843ex;" alt="{\displaystyle \mathbf {N} =[n(t_{1}),......,n(t_{M})]}" loading="lazy">

</mrow>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {S} =[s(t_{1}),......,s(t_{M})]}</annotation>

</semantics>

</math><img src="./7b09836f867390786fb70b4924126cf00b425730.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:24.641ex; height:2.843ex;" alt="{\displaystyle \mathbf {S} =[s(t_{1}),......,s(t_{M})]}" loading="lazy">

Problem definition

“The target is to estimate the DOA’s θ1, θ2, θ3, θ4 …θq of the sources from the M snapshot of the array x(t1)… x(tM). In other words what we are interested in is estimating the DOA’s of emitter signals impinging on receiving array, when given a finite data set {x(t)} observed over t=1, 2 … M. This will be done basically by using the second-order statistics of data”<a href="#cite_note-ref6-5">[5]</a><a href="#cite_note-ref5-8">[8]</a>

In order to solve this problem (to guarantee that there is a valid solution) do we have to add conditions or assumptions on the operational environment and\or the used model? Since there are many parameters used to specify the system like the number of sources, the number of array elements ...etc. are there conditions that should be met first? Toward this goal we want to make the following assumptions:<a href="#cite_note-utexas1-1">[1]</a><a href="#cite_note-ref2-3">[3]</a><a href="#cite_note-ref6-5">[5]</a>

<ol><li>The number of signals is known and is smaller than the number of sensors, q < r.</li>

<li>The set of any q steering vectors is linearly independent.</li>

<li>Isotropic and non-dispersive medium – Uniform propagation in all directions.</li>

<li>Zero mean white noise and signal, uncorrelated.</li>

<li>Far-Field.</li></ol>

<dl><dd><dl><dd>a. Radius of propagation >> size of array.</dd>

<dd>b. Plane wave propagation.</dd></dl></dd></dl>

Throughout this survey, it will be assumed that the number of underlying signals, q, in the observed process is considered known. There are, however, good and consistent techniques for estimating this value even if it is not known.

<div class="mw-heading mw-heading2"><h2 id="Estimation_techniques">Estimation techniques</h2></div>

In general, parameters estimation techniques can be classified into: spectral based and parametric based methods. In the former, one forms some spectrum-like function of the parameter(s) of interest. The locations of the highest (separated) peaks of the function in question are recorded as the DOA estimates. Parametric techniques, on the other hand, require a simultaneous search for all parameters of interest. The basic advantage of using the parametric approach comparing to the spectral based approach is the accuracy, albeit at the expense of an increased computational complexity.<a href="#cite_note-utexas1-1">[1]</a><a href="#cite_note-ref2-3">[3]</a><a href="#cite_note-ref6-5">[5]</a>

<div class="mw-heading mw-heading3"><h3 id="Spectral–based_solutions">Spectral–based solutions</h3></div>

Spectral based algorithmic solutions can be further classified into beamforming techniques and subspace-based techniques.

<div class="mw-heading mw-heading4"><h4 id="Beamforming_technique">Beamforming technique</h4></div>

The first method used to specify and automatically localize the signal sources using antenna arrays was the beamforming technique. The idea behind beamforming is very simple: steer the array in one direction at a time and measure the output power. The steering locations where we have the maximum power yield the DOA estimates. The array response is steered by forming a linear combination of the sensor outputs.<a href="#cite_note-ref2-3">[3]</a><a href="#cite_note-ref6-5">[5]</a><a href="#cite_note-ref5-8">[8]</a>

Approach overview

<msub>

</mrow>

</msub>

<mfrac>

</mfrac>

</mrow>

</mrow>

</mrow>

</munderover>

</mrow>

<msup>

</mrow>

</mrow>

</msup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle 1.\ R_{x}={\frac {1}{M}}\sum _{t=1}^{M}\mathbf {x} (t)\mathbf {x} ^{*}(t)}</annotation>

</semantics>

</math><img src="./f51bf9b28944aa94c71e65f3d222f4eb8b6b5316.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -1.171ex; width:26.316ex; height:3.676ex;" alt="{\displaystyle \textstyle 1.\ R_{x}={\frac {1}{M}}\sum _{t=1}^{M}\mathbf {x} (t)\mathbf {x} ^{*}(t)}" loading="lazy">

<msub>

</mrow>

</msub>

<msup>

</mrow>

</msup>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle 2.\ Calculate\ B(W_{i})=F^{*}R_{x}F(W_{i})}</annotation>

</semantics>

</math><img src="./5a14a91f86363fda404e48bb3fd411daf78eead7.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:34.857ex; height:2.843ex;" alt="{\displaystyle \textstyle 2.\ Calculate\ B(W_{i})=F^{*}R_{x}F(W_{i})}" loading="lazy">

<msub>

</mrow>

</msub>

</mrow>

</msubsup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle 3.\ Find\ Peaks\ of\ B(W_{i})\ for\ all\ possible\ w_{i}'s.}</annotation>

</semantics>

</math><img src="./59dcbd71f88c5cc9a6bc538e0fab1859a148d9c3.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -1.005ex; width:45.269ex; height:3.009ex;" alt="{\displaystyle \textstyle 3.\ Find\ Peaks\ of\ B(W_{i})\ for\ all\ possible\ w_{i}'s.}" loading="lazy">

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle 4.\ Calculate\ \theta _{k},\ i=1,....q.}</annotation>

</semantics>

</math><img src="./76eb14b928b50cfb5bba249fc73666f2dbe14ffe.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:28.586ex; height:2.509ex;" alt="{\displaystyle \textstyle 4.\ Calculate\ \theta _{k},\ i=1,....q.}" loading="lazy">

Where Rx is the sample <a href="Covariance_matrix" title="Covariance matrix">covariance matrix</a>. Different beamforming approaches correspond to different choices of the weighting vector F. The advantages of using beamforming technique are the simplicity, easy to use and understand. While the disadvantage of using this technique is the low resolution.

<div class="mw-heading mw-heading4"><h4 id="Subspace-based_technique">Subspace-based technique</h4></div>

Many spectral methods in the past have called upon the spectral decomposition of a covariance matrix to carry out the analysis. A breakthrough came about when the eigen-structure of the covariance matrix was explicitly invoked, and its intrinsic properties were directly used to provide a solution to an underlying estimation problem for a given observed process. A class of spatial spectral estimation techniques is based on the eigen-value decomposition of the spatial covariance matrix. The rationale behind this approach is that one wants to emphasize the choices for the steering vector a(θ) which correspond to signal directions. The method exploits the property that the directions of arrival determine the eigen structure of the matrix.

The tremendous interest in the subspace based methods is mainly due to the introduction of the <a href="MUSIC_(algorithm)" title="MUSIC (algorithm)">MUSIC (Multiple Signal Classification)</a> algorithm. MUSIC was originally presented as a DOA estimator, then it has been successfully brought back to the spectral analysis/system identification problem with its later development.<a href="#cite_note-ref2-3">[3]</a><a href="#cite_note-ref6-5">[5]</a><a href="#cite_note-ref5-8">[8]</a>

Approach overview

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle 1.\ Subspace\ decomposition\ by\ performing\ eigenvalue\ decomposition:}</annotation>

</semantics>

</math><img src="./6fae7b2f7654bc10040a9053aa137793cff28a5b.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:70.856ex; height:2.509ex;" alt="{\displaystyle \textstyle 1.\ Subspace\ decomposition\ by\ performing\ eigenvalue\ decomposition:}" loading="lazy">

<msub>

</mrow>

</msub>

</mrow>

<msub>

</mrow>

</mrow>

</msub>

<msup>

</mrow>

</mrow>

</msup>

<msup>

</mrow>

</msup>

</mrow>

</mrow>

</munderover>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mrow>

</mrow>

</msubsup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle R_{x}=\mathbf {A} \mathbf {R} _{s}\mathbf {A} ^{*}+\sigma ^{2}I=\sum _{k=1}^{M}\lambda _{k}e_{k}r_{k}^{*}}</annotation>

</semantics>

</math><img src="./9078c7c39094b582d874c208d62c39149616899c.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -1.005ex; width:36.414ex; height:3.509ex;" alt="{\displaystyle \textstyle R_{x}=\mathbf {A} \mathbf {R} _{s}\mathbf {A} ^{*}+\sigma ^{2}I=\sum _{k=1}^{M}\lambda _{k}e_{k}r_{k}^{*}}" loading="lazy">

</mrow>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle 2.\ span\{\mathbf {A} \}=spane\{e1,....,e_{d}\}=span\{\mathbf {E} _{s}\}.}</annotation>

</semantics>

</math><img src="./47a9970eadb91d9384ad5a2b0cbe2f561ccdc3fd.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:47.35ex; height:2.843ex;" alt="{\displaystyle \textstyle 2.\ span\{\mathbf {A} \}=spane\{e1,....,e_{d}\}=span\{\mathbf {E} _{s}\}.}" loading="lazy">

<msub>

</mrow>

</mrow>

</msub>

<msub>

</mrow>

</mrow>

</msub>

</mrow>

</mrow>

</msubsup>

<msub>

</mrow>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle 3.\ Check\ which\ a(\theta )\ \epsilon span\{\mathbf {E} _{s}\}\ or\ \mathbf {P} _{A}a(\theta )\ or\ P_{\mathbf {A} }^{\perp }a(\theta ),\ where\ \mathbf {P} _{A}\ is\ a\ projection\ matrix.}</annotation>

</semantics>

</math><img src="./ed8b7bc329f50dcefb8456af2bd92ba0ff74ba27.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -1.005ex; width:88.938ex; height:3.176ex;" alt="{\displaystyle \textstyle 3.\ Check\ which\ a(\theta )\ \epsilon span\{\mathbf {E} _{s}\}\ or\ \mathbf {P} _{A}a(\theta )\ or\ P_{\mathbf {A} }^{\perp }a(\theta ),\ where\ \mathbf {P} _{A}\ is\ a\ projection\ matrix.}" loading="lazy">

<msup>

<mrow>

<mrow>

</mrow>

</mrow>

</msubsup>

</mrow>

</mrow>

</mrow>

</msup>

<mfrac>

<mrow>

<msub>

</mrow>

</msub>

</mrow>

</mfrac>

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle 4.\ Search\ for\ all\ possible\ \theta \ such\ that:\left|P_{\mathbf {A} }^{\perp }a(\theta )\right|^{2}=0\ or\ M(\theta )={\frac {1}{P_{A}a(\theta )}}=\infty }</annotation>

</semantics>

</math><img src="./af007bce7b7a3d68232eb97b428a3da1b51f3490.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -1.838ex; width:76.496ex; height:4.509ex;" alt="{\displaystyle \textstyle 4.\ Search\ for\ all\ possible\ \theta \ such\ that:\left|P_{\mathbf {A} }^{\perp }a(\theta )\right|^{2}=0\ or\ M(\theta )={\frac {1}{P_{A}a(\theta )}}=\infty }" loading="lazy">

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle 5.\ After\ EVD\ of\ R_{x}:}</annotation>

</semantics>

</math><img src="./0657263498356d096aff790d8b98b5639a718773.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:22.247ex; height:2.509ex;" alt="{\displaystyle \textstyle 5.\ After\ EVD\ of\ R_{x}:}" loading="lazy">

</mrow>

</mrow>

</msubsup>

<msub>

</mrow>

</msub>

</mrow>

</mrow>

</msubsup>

<msub>

</mrow>

</msub>

</mrow>

</mrow>

</msubsup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle P_{A}^{\perp }=I-E_{s}E_{s}^{*}=E_{n}E_{n}^{*}}</annotation>

</semantics>

</math><img src="./e327bd928e446bedce68165fd0a3b1ca1dc96d34.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -1.005ex; width:24.975ex; height:3.176ex;" alt="{\displaystyle \textstyle P_{A}^{\perp }=I-E_{s}E_{s}^{*}=E_{n}E_{n}^{*}}" loading="lazy">

where the noise <a href="Eigenvector_matrix" class="mw-redirect" title="Eigenvector matrix">eigenvector matrix</a> <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle E_{n}=[e_{d}+1,....,e_{M}]}">

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle E_{n}=[e_{d}+1,....,e_{M}]}</annotation>

</semantics>

</math><img src="./5b1d4de2fd909e553dfc6ada6be426b815ebf4d6.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:22.75ex; height:2.843ex;" alt="{\displaystyle E_{n}=[e_{d}+1,....,e_{M}]}" loading="lazy">

MUSIC spectrum approaches use a single realization of the <a href="Stochastic_process" title="Stochastic process">stochastic process</a> that is represent by the snapshots x (t), t=1, 2 ...M. MUSIC estimates are consistent and they converge to true source bearings as the number of snapshots grows to infinity. A basic drawback of MUSIC approach is its sensitivity to model errors. A costly procedure of calibration is required in MUSIC and it is very sensitive to errors in the calibration procedure. The cost of calibration increases as the number of parameters that define the array manifold increases.

<div class="mw-heading mw-heading3"><h3 id="Parametric–based_solutions">Parametric–based solutions</h3></div>

While the spectral-based methods presented in the previous section are computationally attractive, they do not always yield sufficient accuracy. In particular, for the cases when we have highly correlated signals, the performance of spectral-based methods may be insufficient. An alternative is to more fully exploit the underlying data model, leading to so-called parametric array processing methods. The cost of using such methods to increase the efficiency is that the algorithms typically require a multidimensional search to find the estimates. The most common used model based approach in signal processing is the maximum likelihood (ML) technique. This method requires a statistical framework for the data generation process. When applying the ML technique to the array processing problem, two main methods have been considered depending on the signal data model assumption. According to the Stochastic ML, the signals are modeled as Gaussian random processes. On the other hand, in the Deterministic ML the signals are considered as unknown, deterministic quantities that need to be estimated in conjunction with the direction of arrival.<a href="#cite_note-ref2-3">[3]</a><a href="#cite_note-ref6-5">[5]</a><a href="#cite_note-ref5-8">[8]</a>

<div class="mw-heading mw-heading4"><h4 id="Stochastic_ML_approach">Stochastic ML approach</h4></div>

The stochastic maximum likelihood method is obtained by modeling the signal waveforms as a Gaussian random process under the assumption that the process x(t) is a stationary, zero-mean, Gaussian process that is completely described by its second-order covariance matrix. This model is a reasonable one if the measurements are obtained by filtering wide-band signals using a narrow band-pass filter.

Approach overview

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle 1.\ Find\ W_{K}\ to\ minimize:}</annotation>

</semantics>

</math><img src="./bb9f7da214fdc8b7804b6a2ef52a9a0cbbae3dc6.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:26.486ex; height:2.509ex;" alt="{\displaystyle \textstyle 1.\ Find\ W_{K}\ to\ minimize:}" loading="lazy">

<msub>

<msup>

</mrow>

</msup>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mrow>

</msub>

<msup>

<mrow>

<mrow>

<msub>

</mrow>

</msub>

</mrow>

</mrow>

</mrow>

</msup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle min_{a^{*}(\theta _{k}w_{k}=1)}\ E\{\left|W_{k}X(t)\right|^{2}\}}</annotation>

</semantics>

</math><img src="./7c7c0b566593967bc272513eb0bac15cfd3a1cbf.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -1.171ex; width:28.158ex; height:3.676ex;" alt="{\displaystyle \textstyle min_{a^{*}(\theta _{k}w_{k}=1)}\ E\{\left|W_{k}X(t)\right|^{2}\}}" loading="lazy">

<msub>

<msup>

</mrow>

</msup>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mrow>

</msub>

</mrow>

</mrow>

</msubsup>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle =min_{a^{*}(\theta _{k}w_{k}=1)}\ W_{k}^{*}R_{k}W_{k}}</annotation>

</semantics>

</math><img src="./f9b446644d24e026ca4084a60816b864459d63c3.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -1.171ex; width:25.949ex; height:3.009ex;" alt="{\displaystyle \textstyle =min_{a^{*}(\theta _{k}w_{k}=1)}\ W_{k}^{*}R_{k}W_{k}}" loading="lazy">

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle 2.\ Use\ the\ langrange\ method:}</annotation>

</semantics>

</math><img src="./371b275168a4aae64555280fe57765c4774322cb.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:30.595ex; height:2.509ex;" alt="{\displaystyle \textstyle 2.\ Use\ the\ langrange\ method:}" loading="lazy">

<msub>

<msup>

</mrow>

</msup>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mrow>

</msub>

<msup>

<mrow>

<mrow>

<msub>

</mrow>

</msub>

</mrow>

</mrow>

</mrow>

</msup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle min_{a^{*}(\theta _{k}w_{k}=1)}\ E\{\left|W_{k}X(t)\right|^{2}\}}</annotation>

</semantics>

</math><img src="./7c7c0b566593967bc272513eb0bac15cfd3a1cbf.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -1.171ex; width:28.158ex; height:3.676ex;" alt="{\displaystyle \textstyle min_{a^{*}(\theta _{k}w_{k}=1)}\ E\{\left|W_{k}X(t)\right|^{2}\}}" loading="lazy">

<msub>

<msup>

</mrow>

</msup>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mrow>

</msub>

</mrow>

</mrow>

</msubsup>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msup>

</mrow>

</msup>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle =min_{a^{*}(\theta _{k}w_{k}=1)}\ W_{k}^{*}R_{k}W_{k}+2\mu (a^{*}(\theta _{k})w_{k}\Leftrightarrow 1)}</annotation>

</semantics>

</math><img src="./23000ebc2fcd5cfa16a94ebac36c1d648a80709f.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -1.171ex; width:46.965ex; height:3.176ex;" alt="{\displaystyle \textstyle =min_{a^{*}(\theta _{k}w_{k}=1)}\ W_{k}^{*}R_{k}W_{k}+2\mu (a^{*}(\theta _{k})w_{k}\Leftrightarrow 1)}" loading="lazy">

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle 3.\ Differentiating\ it,\ we\ obtain}</annotation>

</semantics>

</math><img src="./76109e8cb022772444eae13a0d8dd97921a56eb5.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:32.866ex; height:2.509ex;" alt="{\displaystyle \textstyle 3.\ Differentiating\ it,\ we\ obtain}" loading="lazy">

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mrow>

</mrow>

</msubsup>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle R_{x}w_{k}=\mu a(\theta _{k}),\ or\ W_{k}=\mu R_{x}^{-1}a(\theta _{k})}</annotation>

</semantics>

</math><img src="./d254f86912b4932e329db4d49b3db81d8b2f1e73.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:36.877ex; height:3.176ex;" alt="{\displaystyle \textstyle R_{x}w_{k}=\mu a(\theta _{k}),\ or\ W_{k}=\mu R_{x}^{-1}a(\theta _{k})}" loading="lazy">

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle 4.\ since}</annotation>

</semantics>

</math><img src="./653a625286c6903251aaa1edf64ef35e46c3fece.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:7.768ex; height:2.176ex;" alt="{\displaystyle \textstyle 4.\ since}" loading="lazy">

<msup>

</mrow>

</msup>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msup>

</mrow>

</msup>

</mrow>

</mrow>

</msubsup>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle a^{*}(\theta _{k})W_{k}=\mu a(\theta _{k})^{*}R_{x}^{-1}a(\theta _{k})=1}</annotation>

</semantics>

</math><img src="./e4c413d0262df0bf6ada58175750dc292930fe72.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:33.904ex; height:3.176ex;" alt="{\displaystyle \textstyle a^{*}(\theta _{k})W_{k}=\mu a(\theta _{k})^{*}R_{x}^{-1}a(\theta _{k})=1}" loading="lazy">

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle Then}</annotation>

</semantics>

</math><img src="./6e0bd9fa5642c8d42eb8f3bd9c2546af74f2e165.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:5.453ex; height:2.176ex;" alt="{\displaystyle \textstyle Then}" loading="lazy">

<msub>

</mrow>

</msub>

<msup>

</mrow>

</msup>

</mrow>

</mrow>

</msubsup>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle \mu =a(\theta _{k})^{*}R_{x}^{-1}a(\theta _{k})}</annotation>

</semantics>

</math><img src="./fc8944b338f05390923d540c2b27c18ccc7bc195.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:20.088ex; height:3.176ex;" alt="{\displaystyle \textstyle \mu =a(\theta _{k})^{*}R_{x}^{-1}a(\theta _{k})}" loading="lazy">

<msup>

</msup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle 5.\ Capon's\ Beamformer}</annotation>

</semantics>

</math><img src="./e04b71829919259f48a7ffb01f728e937fe4a89e.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:25.179ex; height:2.676ex;" alt="{\displaystyle \textstyle 5.\ Capon's\ Beamformer}" loading="lazy">

<msub>

</mrow>

</msub>

</mrow>

</mrow>

</msubsup>

<msub>

</mrow>

</msub>

</mrow>

<msup>

</mrow>

</msup>

<msub>

</mrow>

</msub>

</mrow>

</mrow>

</msubsup>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \textstyle W_{k}=R_{x}^{-1}a(\theta _{k})/(a^{*}(\theta _{k})R_{x}^{-1}a(\theta _{k}))}</annotation>

</semantics>

</math><img src="./5c7ecac98c96696ac8dc20683f40f4247277a02c.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:34.255ex; height:3.176ex;" alt="{\displaystyle \textstyle W_{k}=R_{x}^{-1}a(\theta _{k})/(a^{*}(\theta _{k})R_{x}^{-1}a(\theta _{k}))}" loading="lazy">

<div class="mw-heading mw-heading4"><h4 id="Deterministic_ML_approach">Deterministic ML approach</h4></div>

While the background and receiver noise in the assumed data model can be thought of as emanating from a large number of independent noise sources, the same is usually not the case for the emitter signals. It therefore appears natural to model the noise as a stationary Gaussian white random process whereas the signal waveforms are deterministic (arbitrary) and unknown. According to the Deterministic ML the signals are considered as unknown, deterministic quantities that need to be estimated in conjunction with the direction of arrival. This is a natural model for digital communication applications where the signals are far from being normal random variables, and where estimation of the signal is of equal interest.<a href="#cite_note-ref2-3">[3]</a><a href="#cite_note-ref3-4">[4]</a>

<div class="mw-heading mw-heading2"><h2 id="Correlation_spectrometer">Correlation spectrometer</h2></div>

The problem of computing pairwise correlation as a function of frequency can be solved by two mathematically equivalent but distinct ways. By using <a href="Discrete_Fourier_Transform" class="mw-redirect" title="Discrete Fourier Transform">Discrete Fourier Transform</a> (DFT) it is possible to analyze signals in the time domain as well as in the spectral domain. The first approach is "XF" correlation because it first cross-correlates antennas (the "X" operation) using a time-domain "lag" convolution, and then computes the spectrum (the "F" operation) for each resulting baseline. The second approach "FX" takes advantage of the fact that convolution is equivalent to multiplication in Fourier domain. It first computes the spectrum for each individual antenna (the F operation), and then multiplies pairwise all antennas for each spectral channel (the X operation). A FX correlator has an advantage over a XF correlators in that the computational complexity is <a href="Big_O_notation" title="Big O notation">O</a>(N2). Therefore, FX correlators are more efficient for larger arrays.<a href="#cite_note-10">[10]</a>

Correlation spectrometers like the <a href="Michelson_interferometer" title="Michelson interferometer">Michelson interferometer</a> vary the time lag between signals obtain the power spectrum of input signals. The power spectrum <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle S_{\text{XX}}(f)}">

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle S_{\text{XX}}(f)}</annotation>

</semantics>

</math><img src="./94870464785d10d8ca7c111176f86054c0b83498.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:7.21ex; height:2.843ex;" alt="{\displaystyle S_{\text{XX}}(f)}" loading="lazy"> of a signal is related to its autocorrelation function by a Fourier transform:<a href="#cite_note-Harris-11">[11]</a>

/* start https://en.wikipedia.org/ */

.mw-parser-output table.numblk{border-collapse:collapse;border:none;margin-top:0;margin-right:0;margin-bottom:0}.mw-parser-output table.numblk>tbody>tr>td{vertical-align:middle;padding:0}.mw-parser-output table.numblk>tbody>tr>td:nth-child(2){width:99%}.mw-parser-output table.numblk>tbody>tr>td:nth-child(2)>table{border-collapse:collapse;margin:0;border:none;width:100%}.mw-parser-output table.numblk>tbody>tr>td:nth-child(2)>table>tbody>tr:first-child>td:first-child,.mw-parser-output table.numblk>tbody>tr>td:nth-child(2)>table>tbody>tr:first-child>td:last-child{padding:0 0.4ex}.mw-parser-output table.numblk>tbody>tr>td:nth-child(2)>table>tbody>tr:first-child>td:nth-child(2){width:100%;padding:0}.mw-parser-output table.numblk>tbody>tr>td:nth-child(2)>table>tbody>tr:last-child>td{padding:0}.mw-parser-output table.numblk>tbody>tr>td:last-child{font-weight:bold}.mw-parser-output table.numblk.numblk-raw-n>tbody>tr>td:last-child{font-weight:unset}.mw-parser-output table.numblk>tbody>tr>td:last-child::before{content:"("}.mw-parser-output table.numblk>tbody>tr>td:last-child::after{content:")"}.mw-parser-output table.numblk.numblk-raw-n>tbody>tr>td:last-child::before,.mw-parser-output table.numblk.numblk-raw-n>tbody>tr>td:last-child::after{content:none}.mw-parser-output table.numblk>tbody>tr>td{border:none}.mw-parser-output table.numblk.numblk-border>tbody>tr>td{border:thin solid}.mw-parser-output table.numblk>tbody>tr>td:nth-child(2)>table>tbody>tr:first-child>td{border:none}.mw-parser-output table.numblk.numblk-border>tbody>tr>td:nth-child(2)>table>tbody>tr:first-child>td{border:thin solid}.mw-parser-output table.numblk>tbody>tr>td:nth-child(2)>table>tbody>tr:last-child>td{border-left:none;border-right:none;border-bottom:none}.mw-parser-output table.numblk.numblk-border>tbody>tr>td:nth-child(2)>table>tbody>tr:last-child>td{border-left:thin solid;border-right:thin solid;border-bottom:thin solid}.mw-parser-output table.numblk:target{color:var(--color-base,#202122);background-color:#cfe8fd}@media screen{html.skin-theme-clientpref-night .mw-parser-output table.numblk:target{color:var(--color-base,#eaecf0);background-color:#301702}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output table.numblk:target{color:var(--color-base,#eaecf0);background-color:#301702}}

/* end https://en.wikipedia.org/ */

</style><table role="presentation" class="numblk" style="margin-left: 1.6em;"><tbody><tr><td class="nowrap"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle S_{\text{XX}}(f)=\int _{-\infty }^{\infty }R_{\text{XX}}(\tau )\cos(2\pi f\tau ),\mathrm {d} \tau }">

<msub>

</mrow>

</msub>

</mrow>

</mrow>

</msubsup>

<msub>

</mrow>

</msub>

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle S_{\text{XX}}(f)=\int _{-\infty }^{\infty }R_{\text{XX}}(\tau )\cos(2\pi f\tau ),\mathrm {d} \tau }</annotation>

</semantics>

</math><img src="./2a5ccdb7d6245e629f62156f24cd02e16d0df21b.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -2.505ex; width:36.426ex; height:6.009ex;" alt="{\displaystyle S_{\text{XX}}(f)=\int _{-\infty }^{\infty }R_{\text{XX}}(\tau )\cos(2\pi f\tau ),\mathrm {d} \tau }" loading="lazy"></td> <td></td> <td class="nowrap">I</td></tr></tbody></table>

where the autocorrelation function <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle R_{\text{XX}}(\tau )}">

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle R_{\text{XX}}(\tau )}</annotation>

</semantics>

</math><img src="./3fcadbb3c161e478b3f01663fd325748a5b93ab8.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:7.473ex; height:2.843ex;" alt="{\displaystyle R_{\text{XX}}(\tau )}" loading="lazy"> for signal X as a function of time delay <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \tau }">

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \tau }</annotation>

</semantics>

</math><img src="./38a7dcde9730ef0853809fefc18d88771f95206c.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.202ex; height:1.676ex;" alt="{\displaystyle \tau }" loading="lazy"> is

<msub>

</mrow>

</msub>

<mrow>

<mrow>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mrow>

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle R_{\text{XX}}(\tau )=\left(V_{X}(t)V_{X}(t+\tau )\right)}</annotation>

</semantics>

</math><img src="./dc3a199b070005502f5ee9e43d55d8098e7c6c24.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:27.696ex; height:2.843ex;" alt="{\displaystyle R_{\text{XX}}(\tau )=\left(V_{X}(t)V_{X}(t+\tau )\right)}" loading="lazy"></td> <td></td> <td class="nowrap">II</td></tr></tbody></table>

Cross-correlation spectroscopy with spatial interferometry, is possible by simply substituting a signal with voltage <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle V_{Y}(t)}">

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle V_{Y}(t)}</annotation>

</semantics>

</math><img src="./c4d1a5ea1f406e8da3cccefa778399518572cca1.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:5.49ex; height:2.843ex;" alt="{\displaystyle V_{Y}(t)}" loading="lazy"> in equation <a href="#math_Eq.II">Eq.II</a> to produce the cross-correlation <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle R_{\text{XY}}(\tau )}">

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle R_{\text{XY}}(\tau )}</annotation>

</semantics>

</math><img src="./68a790def2aa7889480055339b4eb0c47b502b94.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:7.473ex; height:2.843ex;" alt="{\displaystyle R_{\text{XY}}(\tau )}" loading="lazy"> and the cross-spectrum <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle S_{\text{XY}}(f)}">

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle S_{\text{XY}}(f)}</annotation>

</semantics>

</math><img src="./5d23eefa609bce111d460333e64ece882a0b2a73.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:7.21ex; height:2.843ex;" alt="{\displaystyle S_{\text{XY}}(f)}" loading="lazy">.

<div class="mw-heading mw-heading2"><h2 id="Example:_spatial_filtering">Example: spatial filtering</h2></div>

In radio astronomy, RF interference must be mitigated to detect and observe any meaningful objects and events in the night sky.

<div class="mw-heading mw-heading3"><h3 id="Projecting_out_the_interferer">Projecting out the interferer</h3></div>

For an array of Radio Telescopes with a spatial signature of the interfering source <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbf {a} }">

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {a} }</annotation>

</semantics>

</math><img src="./1a957216653a9ee0d0133dcefd13fb75e36b8b9d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.299ex; height:1.676ex;" alt="{\displaystyle \mathbf {a} }" loading="lazy"> that is not a known function of the direction of interference and its time variance, the signal covariance matrix takes the form:

</mrow>

<msub>

</mrow>

</mrow>

</msub>

</mrow>

</mrow>

</msubsup>

</mrow>

<msup>

</mrow>

</mrow>

</msup>

</mrow>

</mrow>

</msubsup>

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {R} =\mathbf {R} _{v}+\sigma _{s}^{2}\mathbf {a} \mathbf {a} ^{\dagger }+\sigma _{n}^{2}\mathbf {I} }</annotation>

</semantics>

</math><img src="./251d13d3263ef29e4802f49926bb3baea6727ec5.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:23.321ex; height:3.009ex;" alt="{\displaystyle \mathbf {R} =\mathbf {R} _{v}+\sigma _{s}^{2}\mathbf {a} \mathbf {a} ^{\dagger }+\sigma _{n}^{2}\mathbf {I} }" loading="lazy">

where <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbf {R} _{v}}">

<msub>

</mrow>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {R} _{v}}</annotation>

</semantics>

</math><img src="./d4600a4eb45926c1db1e5de4ab3e11514ecb8e0d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:3.033ex; height:2.509ex;" alt="{\displaystyle \mathbf {R} _{v}}" loading="lazy"> is the visibilities covariance matrix (sources), <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \sigma _{s}^{2}}">

</mrow>

</mrow>

</msubsup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \sigma _{s}^{2}}</annotation>

</semantics>

</math><img src="./3e4d9c8b2006799ab5d9f1a3e8ecbcd12beb4581.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.385ex; height:2.843ex;" alt="{\displaystyle \sigma _{s}^{2}}" loading="lazy"> is the power of the interferer, and <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \sigma _{n}^{2}}">

</mrow>

</mrow>

</msubsup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \sigma _{n}^{2}}</annotation>

</semantics>

</math><img src="./5205c034276bd3550a5869954fcb38a145bb8b6f.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.546ex; height:2.843ex;" alt="{\displaystyle \sigma _{n}^{2}}" loading="lazy"> is the noise power, and <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \dagger }">

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \dagger }</annotation>

</semantics>

</math><img src="./2fbce70d5be6fec538cd30d8bc7b7bb2d3ed2d3e.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:1.032ex; height:2.676ex;" alt="{\displaystyle \dagger }" loading="lazy"> denotes the Hermitian transpose. One can construct a projection matrix <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbf {P} _{a}^{\perp }}">

</mrow>

</mrow>

</mrow>

</msubsup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {P} _{a}^{\perp }}</annotation>

</semantics>

</math><img src="./e4b7bde5b742c99d00e782b35d452a17d2523008.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:3.338ex; height:3.176ex;" alt="{\displaystyle \mathbf {P} _{a}^{\perp }}" loading="lazy">, which, when left and right multiplied by the signal covariance matrix, will reduce the interference term to zero.

</mrow>

</mrow>

</mrow>

</msubsup>

</mrow>

</mrow>

<msup>

</mrow>

</mrow>

</msup>

</mrow>

<msup>

</mrow>

</msup>

<msup>

</mrow>

</mrow>

</msup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {P} _{a}^{\perp }=\mathbf {I} -\mathbf {a} (\mathbf {a} ^{\dagger }\mathbf {a} )^{-1}\mathbf {a} ^{\dagger }}</annotation>

</semantics>

</math><img src="./7fd9b2bbcbf82fa3cd4399ecdb3a166c44814524.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:21.555ex; height:3.176ex;" alt="{\displaystyle \mathbf {P} _{a}^{\perp }=\mathbf {I} -\mathbf {a} (\mathbf {a} ^{\dagger }\mathbf {a} )^{-1}\mathbf {a} ^{\dagger }}" loading="lazy">

So the modified signal covariance matrix becomes:

<mover>

</mrow>

</mover>

</mrow>

</mrow>

</mrow>

</mrow>

</msubsup>

</mrow>

</mrow>

</mrow>

</mrow>

</msubsup>

</mrow>

</mrow>

</mrow>

</msubsup>

<msub>

</mrow>

</mrow>

</msub>

</mrow>

</mrow>

</mrow>

</msubsup>

</mrow>

</mrow>

</msubsup>

</mrow>

</mrow>

</mrow>

</msubsup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle {\tilde {\mathbf {R} }}=\mathbf {P} _{a}^{\perp }\mathbf {R} \mathbf {P} _{a}^{\perp }=\mathbf {P} _{a}^{\perp }\mathbf {R} _{v}\mathbf {P} _{a}^{\perp }+\sigma _{n}^{2}\mathbf {P} _{a}^{\perp }}</annotation>

</semantics>

</math><img src="./f68bd450b6dc1577cd6d4f513006e79f2f94d5cf.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:35.31ex; height:3.176ex;" alt="{\displaystyle {\tilde {\mathbf {R} }}=\mathbf {P} _{a}^{\perp }\mathbf {R} \mathbf {P} _{a}^{\perp }=\mathbf {P} _{a}^{\perp }\mathbf {R} _{v}\mathbf {P} _{a}^{\perp }+\sigma _{n}^{2}\mathbf {P} _{a}^{\perp }}" loading="lazy">

Since <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbf {a} }">

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {a} }</annotation>

</semantics>

</math><img src="./1a957216653a9ee0d0133dcefd13fb75e36b8b9d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.299ex; height:1.676ex;" alt="{\displaystyle \mathbf {a} }" loading="lazy"> is generally not known, <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbf {P} _{a}^{\perp }}">

</mrow>

</mrow>

</mrow>

</msubsup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {P} _{a}^{\perp }}</annotation>

</semantics>

</math><img src="./e4b7bde5b742c99d00e782b35d452a17d2523008.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:3.338ex; height:3.176ex;" alt="{\displaystyle \mathbf {P} _{a}^{\perp }}" loading="lazy"> can be constructed using the eigen-decomposition of <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbf {R} }">

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {R} }</annotation>

</semantics>

</math><img src="./5de85fcc2a00d8ba14aae84aeef812d7fef4b3d5.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:2.003ex; height:2.176ex;" alt="{\displaystyle \mathbf {R} }" loading="lazy">, in particular the matrix containing an orthonormal basis of the noise subspace, which is the orthogonal complement of <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbf {a} }">

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {a} }</annotation>

</semantics>

</math><img src="./1a957216653a9ee0d0133dcefd13fb75e36b8b9d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.299ex; height:1.676ex;" alt="{\displaystyle \mathbf {a} }" loading="lazy">. The disadvantages to this approach include altering the visibilities covariance matrix and coloring the white noise term.<a href="#cite_note-12">[12]</a>

<div class="mw-heading mw-heading3"><h3 id="Spatial_whitening">Spatial whitening</h3></div>

This scheme attempts to make the interference-plus-noise term spectrally white. To do this, left and right multiply <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbf {R} }">

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {R} }</annotation>

</semantics>

</math><img src="./5de85fcc2a00d8ba14aae84aeef812d7fef4b3d5.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:2.003ex; height:2.176ex;" alt="{\displaystyle \mathbf {R} }" loading="lazy"> with inverse square root factors of the interference-plus-noise terms.

<mover>

</mrow>

</mover>

</mrow>

</mrow>

</mrow>

</msubsup>

</mrow>

<msup>

</mrow>

</mrow>

</msup>

</mrow>

</mrow>

</msubsup>

</mrow>

<msup>

<mfrac>

</mfrac>

</mrow>

</msup>

</mrow>

</mrow>

</mrow>

</msubsup>

</mrow>

<msup>

</mrow>

</mrow>

</msup>

</mrow>

</mrow>

</msubsup>

</mrow>

<msup>

<mfrac>

</mfrac>

</mrow>

</msup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle {\tilde {\mathbf {R} }}=(\sigma _{s}^{2}\mathbf {a} \mathbf {a} ^{\dagger }+\sigma _{n}^{2}\mathbf {I} )^{-{\frac {1}{2}}}\mathbf {R} (\sigma _{s}^{2}\mathbf {a} \mathbf {a} ^{\dagger }+\sigma _{n}^{2}\mathbf {I} )^{-{\frac {1}{2}}}}</annotation>

</semantics>

</math><img src="./e5639f804006ba74c154e8bf0afbeaedfc60b8a7.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:41.444ex; height:4.009ex;" alt="{\displaystyle {\tilde {\mathbf {R} }}=(\sigma _{s}^{2}\mathbf {a} \mathbf {a} ^{\dagger }+\sigma _{n}^{2}\mathbf {I} )^{-{\frac {1}{2}}}\mathbf {R} (\sigma _{s}^{2}\mathbf {a} \mathbf {a} ^{\dagger }+\sigma _{n}^{2}\mathbf {I} )^{-{\frac {1}{2}}}}" loading="lazy">

The calculation requires rigorous matrix manipulations, but results in an expression of the form:

<mover>

</mrow>

</mover>

</mrow>

<msup>

<mfrac>

</mfrac>

</mrow>

</msup>

<msub>

</mrow>

</mrow>

</msub>

<msup>

<mfrac>

</mfrac>

</mrow>

</msup>

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle {\tilde {\mathbf {R} }}=(\cdot )^{-{\frac {1}{2}}}\mathbf {R} _{v}(\cdot )^{-{\frac {1}{2}}}+\mathbf {I} }</annotation>

</semantics>

</math><img src="./5165a0161aa63d9e344385f8a9c3c2235e1ae3c3.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:22.93ex; height:4.009ex;" alt="{\displaystyle {\tilde {\mathbf {R} }}=(\cdot )^{-{\frac {1}{2}}}\mathbf {R} _{v}(\cdot )^{-{\frac {1}{2}}}+\mathbf {I} }" loading="lazy">

This approach requires much more computationally intensive matrix manipulations, and again the visibilities covariance matrix is altered.<a href="#cite_note-13">[13]</a>

<div class="mw-heading mw-heading3"><h3 id="Subtraction_of_interference_estimate">Subtraction of interference estimate</h3></div>

Since <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbf {a} }">

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {a} }</annotation>

</semantics>

</math><img src="./1a957216653a9ee0d0133dcefd13fb75e36b8b9d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.299ex; height:1.676ex;" alt="{\displaystyle \mathbf {a} }" loading="lazy"> is unknown, the best estimate is the dominant eigenvector <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbf {u} _{1}}">

<msub>

</mrow>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {u} _{1}}</annotation>

</semantics>

</math><img src="./cb86457c0ac456302419c967bda92a5910ff004c.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.54ex; height:2.009ex;" alt="{\displaystyle \mathbf {u} _{1}}" loading="lazy"> of the eigen-decomposition of <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbf {R} =\mathbf {U} \mathbf {\Lambda } \mathbf {U} ^{\dagger }}">

</mrow>

</mrow>

</mrow>

<msup>

</mrow>

</mrow>

</msup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {R} =\mathbf {U} \mathbf {\Lambda } \mathbf {U} ^{\dagger }}</annotation>

</semantics>

</math><img src="./b31fa3cb56bda8a7787a9d8e370afcb457c5720e.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:12.05ex; height:2.676ex;" alt="{\displaystyle \mathbf {R} =\mathbf {U} \mathbf {\Lambda } \mathbf {U} ^{\dagger }}" loading="lazy">, and likewise the best estimate of the interference power is <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \sigma _{s}^{2}\approx \lambda _{1}-\sigma _{n}^{2}}">

</mrow>

</mrow>

</msubsup>

<msub>

</mrow>

</msub>

</mrow>

</mrow>

</msubsup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \sigma _{s}^{2}\approx \lambda _{1}-\sigma _{n}^{2}}</annotation>

</semantics>

</math><img src="./9188e40f2e85b6b2bab44511c55202200c94fa0b.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:13.279ex; height:2.843ex;" alt="{\displaystyle \sigma _{s}^{2}\approx \lambda _{1}-\sigma _{n}^{2}}" loading="lazy">, where <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \lambda _{1}}">

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \lambda _{1}}</annotation>

</semantics>

</math><img src="./571a423bece8f29bcd1b48572f18dd4f6213dce2.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.409ex; height:2.509ex;" alt="{\displaystyle \lambda _{1}}" loading="lazy"> is the dominant eigenvalue of <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbf {R} }">

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {R} }</annotation>

</semantics>

</math><img src="./5de85fcc2a00d8ba14aae84aeef812d7fef4b3d5.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:2.003ex; height:2.176ex;" alt="{\displaystyle \mathbf {R} }" loading="lazy">. One can subtract the interference term from the signal covariance matrix:

<mover>

</mrow>

</mover>

</mrow>

</mrow>

</mrow>

</mrow>

</msubsup>

</mrow>

<msup>

</mrow>

</mrow>

</msup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle {\tilde {\mathbf {R} }}=\mathbf {R} -\sigma _{s}^{2}\mathbf {a} \mathbf {a} ^{\dagger }}</annotation>

</semantics>

</math><img src="./0abf6bfa085e2360423abffa8311ef56f0625b5d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:15.891ex; height:3.009ex;" alt="{\displaystyle {\tilde {\mathbf {R} }}=\mathbf {R} -\sigma _{s}^{2}\mathbf {a} \mathbf {a} ^{\dagger }}" loading="lazy">

By right and left multiplying <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \mathbf {R} }">

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \mathbf {R} }</annotation>

</semantics>

</math><img src="./5de85fcc2a00d8ba14aae84aeef812d7fef4b3d5.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:2.003ex; height:2.176ex;" alt="{\displaystyle \mathbf {R} }" loading="lazy">:

<mover>

</mrow>

</mover>

</mrow>

</mrow>

<msub>

</mrow>

</mrow>

</msub>

</mrow>

</mrow>

</mrow>

</msubsup>

</mrow>

</mrow>

<msub>

</mrow>

</mrow>

</msub>

</mrow>

</mrow>

</mrow>

</msubsup>

</mrow>

<msub>

</mrow>

</mrow>

</msub>

</mrow>

</mrow>

</mrow>

</msubsup>

<msub>

</mrow>

</msub>

<msup>

</mrow>

</msup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle {\tilde {\mathbf {R} }}\approx (\mathbf {I} -\alpha \mathbf {u} _{1}\mathbf {u} _{1}^{\dagger })\mathbf {R} (\mathbf {I} -\alpha \mathbf {u} _{1}\mathbf {u} _{1}^{\dagger })=\mathbf {R} -\mathbf {u} _{1}\mathbf {u} _{1}^{\dagger }\lambda _{1}(2\alpha -\alpha ^{2})}</annotation>

</semantics>

</math><img src="./f156a91d203baea8e3a84cab389245f0a1196e76.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -1.005ex; width:56.838ex; height:3.509ex;" alt="{\displaystyle {\tilde {\mathbf {R} }}\approx (\mathbf {I} -\alpha \mathbf {u} _{1}\mathbf {u} _{1}^{\dagger })\mathbf {R} (\mathbf {I} -\alpha \mathbf {u} _{1}\mathbf {u} _{1}^{\dagger })=\mathbf {R} -\mathbf {u} _{1}\mathbf {u} _{1}^{\dagger }\lambda _{1}(2\alpha -\alpha ^{2})}" loading="lazy">

where <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \lambda _{1}(2\alpha -\alpha ^{2})\approx \sigma _{s}^{2}}">

<msub>

</mrow>

</msub>

<msup>

</mrow>

</msup>

</mrow>

</mrow>

</msubsup>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \lambda _{1}(2\alpha -\alpha ^{2})\approx \sigma _{s}^{2}}</annotation>

</semantics>

</math><img src="./aff16c454232af56257da3b194c2195c5a6bab8c.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:17.734ex; height:3.176ex;" alt="{\displaystyle \lambda _{1}(2\alpha -\alpha ^{2})\approx \sigma _{s}^{2}}" loading="lazy"> by selecting the appropriate <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle \alpha }">

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \alpha }</annotation>

</semantics>

</math><img src="./b79333175c8b3f0840bfb4ec41b8072c83ea88d3.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.488ex; height:1.676ex;" alt="{\displaystyle \alpha }" loading="lazy">. This scheme requires an accurate estimation of the interference term, but does not alter the noise or sources term.<a href="#cite_note-14">[14]</a>

<div class="mw-heading mw-heading2"><h2 id="Summary">Summary</h2></div>

Array processing technique represents a breakthrough in signal processing. Many applications and problems which are solvable using array processing techniques are introduced. In addition to these applications within the next few years the number of applications that include a form of array signal processing will increase. It is highly expected that the importance of array processing will grow as the automation becomes more common in industrial environment and applications, further advances in digital signal processing and digital signal processing systems will also support the high computation requirements demanded by some of the estimation techniques.

In this article we emphasized the importance of array processing by listing the most important applications that include a form of array processing techniques. We briefly describe the different classifications of array processing, spectral and parametric based approaches. Some of the most important algorithms are covered, the advantage(s) and the disadvantage(s) of these algorithms also explained and discussed.

<ul><li><a href="Phased_array" title="Phased array">Phased array</a></li>

<li><a href="Space-time_adaptive_processing" title="Space-time adaptive processing">Space-time adaptive processing</a></li>

<li><a href="Periodogram" title="Periodogram">Periodogram</a></li>

<li><a href="Matched_filter" title="Matched filter">Matched filter</a></li>

<li><a href="Welch's_method" title="Welch's method">Welch's method</a></li>

<li><a href="Bartlett's_method" title="Bartlett's method">Bartlett's method</a></li>

<div class="mw-heading mw-heading2"><h2 id="References">References</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}

/* end https://en.wikipedia.org/ */

</style><div class="reflist">

<li id="cite_note-utexas1-1">^ <a href="#cite_ref-utexas1_1-0">a</a> <a href="#cite_ref-utexas1_1-1">b</a> <a href="#cite_ref-utexas1_1-2">c</a> <a href="#cite_ref-utexas1_1-3">d</a> Torlak, M. <a rel="nofollow" class="external text" href="http://users.ece.utexas.edu/~bevans/courses/ee381k/lectures/13_Array_Processing/lecture13/lecture13.pdf">Spatial Array Processing</a>. Signal and Image Processing Seminar. University of Texas at Austin.

</li>

/* start https://en.wikipedia.org/ */

.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("./mw/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("./mw/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("./mw/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("./mw/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}

/* end https://en.wikipedia.org/ */

</style><cite id="CITEREFJ_Li2009" class="citation book cs1">J Li, <a href="Peter_Stoica" title="Peter Stoica">Peter Stoica</a> (Eds) (2009). MIMO Radar Signal Processing. USA: J Wiley&Sons.</cite>

</li>

<li id="cite_note-ref2-3">^ <a href="#cite_ref-ref2_3-0">a</a> <a href="#cite_ref-ref2_3-1">b</a> <a href="#cite_ref-ref2_3-2">c</a> <a href="#cite_ref-ref2_3-3">d</a> <a href="#cite_ref-ref2_3-4">e</a> <a href="#cite_ref-ref2_3-5">f</a> <a href="#cite_ref-ref2_3-6">g</a> <a href="#cite_ref-ref2_3-7">h</a> <a href="#cite_ref-ref2_3-8">i</a> <a href="#cite_ref-ref2_3-9">j</a> <cite id="CITEREFPeter_Stoica2005" class="citation book cs1"><a href="Peter_Stoica" title="Peter Stoica">Peter Stoica</a>, R Moses (2005). <a rel="nofollow" class="external text" href="http://user.it.uu.se/%7Eps/SAS-new.pdf">Spectral Analysis of Signals</a> (PDF). NJ: Prentice Hall.</cite>

</li>

<li id="cite_note-ref3-4">^ <a href="#cite_ref-ref3_4-0">a</a> <a href="#cite_ref-ref3_4-1">b</a> <a href="#cite_ref-ref3_4-2">c</a> <cite id="CITEREFJ_Li2006" class="citation book cs1">J Li, <a href="Peter_Stoica" title="Peter Stoica">Peter Stoica</a> (Eds) (2006). Robust Adaptive Beamforming. USA: J Wiley&Sons.</cite>

</li>

<li id="cite_note-ref6-5">^ <a href="#cite_ref-ref6_5-0">a</a> <a href="#cite_ref-ref6_5-1">b</a> <a href="#cite_ref-ref6_5-2">c</a> <a href="#cite_ref-ref6_5-3">d</a> <a href="#cite_ref-ref6_5-4">e</a> <a href="#cite_ref-ref6_5-5">f</a> <a href="#cite_ref-ref6_5-6">g</a> <a href="#cite_ref-ref6_5-7">h</a> <a href="#cite_ref-ref6_5-8">i</a> <cite id="CITEREFSinghJha2012" class="citation cs2">Singh, Hema; Jha, RakeshMohan (2012), Trends in Adaptive Array Processing</cite>

</li>

<li id="cite_note-NORSAR-6"><a href="#cite_ref-NORSAR_6-0">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20130620112533/http://www.norsar.no/norsar/about-us/">"About Us"</a>. NORSAR. Archived from <a rel="nofollow" class="external text" href="http://www.norsar.no/norsar/about-us/">the original</a> on 20 June 2013. Retrieved 6 June 2013.</cite>

</li>

<li id="cite_note-7"><a href="#cite_ref-7">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20120821220803/http://www.norsar.no/pc-31-83-Improving-IMS-array-processing.aspx">"Improving IMS array processing"</a>. Norsar.no. Archived from <a rel="nofollow" class="external text" href="http://www.norsar.no/pc-31-83-Improving-IMS-array-processing.aspx">the original</a> on 2012-08-21. Retrieved 2012-08-06.</cite>

</li>

<li id="cite_note-ref5-8">^ <a href="#cite_ref-ref5_8-0">a</a> <a href="#cite_ref-ref5_8-1">b</a> <a href="#cite_ref-ref5_8-2">c</a> <a href="#cite_ref-ref5_8-3">d</a> <a href="#cite_ref-ref5_8-4">e</a> <a href="#cite_ref-ref5_8-5">f</a> <cite id="CITEREFKrimViberg1995" class="citation cs2">Krim, Hamid; Viberg, Mats (1995), Sensor Array Signal Processing: Two Decades Later</cite>

</li>

<li id="cite_note-9"><a href="#cite_ref-9">^</a> Zelinski, Rainer. "A microphone array with adaptive post-filtering for noise reduction in reverberant rooms." Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on. IEEE, 1988.

</li>

<li id="cite_note-10"><a href="#cite_ref-10">^</a> <cite id="CITEREFParsonsBackerSiemion2008" class="citation journal cs1">Parsons, Aaron; Backer, Donald; <a href="Andrew_Siemion" title="Andrew Siemion">Siemion, Andrew</a> (September 12, 2008). "A Scalable Correlator Architecture Based on Modular FPGA Hardware, Reuseable Gateware, and Data Packetization". Publications of the Astronomical Society of the Pacific. 120 (873): 1207–1221. <a href="ArXiv_(identifier)" class="mw-redirect" title="ArXiv (identifier)">arXiv</a>:<a rel="nofollow" class="external text" href="https://arxiv.org/abs/0809.2266">0809.2266</a>. <a href="Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2008PASP..120.1207P">2008PASP..120.1207P</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1086%2F593053">10.1086/593053</a>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:14152210">14152210</a>.</cite>

</li>

<li id="cite_note-Harris-11"><a href="#cite_ref-Harris_11-0">^</a> <a rel="nofollow" class="external text" href="http://www.sofia.usra.edu/det_workshop/papers/session4/4-04harris_edjw021022.pdf">Spectrometers for Heterodyne Detection</a> <a rel="nofollow" class="external text" href="https://web.archive.org/web/20160307051932/http://www.sofia.usra.edu/det_workshop/papers/session4/4-04harris_edjw021022.pdf">Archived</a> March 7, 2016, at the <a href="Wayback_Machine" title="Wayback Machine">Wayback Machine</a> Andrew Harris

</li>

<li id="cite_note-12"><a href="#cite_ref-12">^</a> <cite id="CITEREFJamil_RazaAlbert-Jan_BoonstraAlle-Jan_van_der_Veen2002" class="citation journal cs1">Jamil Raza; Albert-Jan Boonstra; Alle-Jan van der Veen (February 2002). <a rel="nofollow" class="external text" href="http://resolver.tudelft.nl/uuid:26525a9b-0815-49e2-82c8-b3c69ed4867f">"Spatial Filtering of RF Interference in Radio Astronomy"</a>. IEEE Signal Processing Letters. 9 (12): 64–67. <a href="Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2002ISPL....9...64R">2002ISPL....9...64R</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2F97.991140">10.1109/97.991140</a>.</cite>

</li>

<li id="cite_note-13"><a href="#cite_ref-13">^</a> <cite id="CITEREFAmir_LeshemAlle-Jan_van_der_Veen2000" class="citation journal cs1">Amir Leshem; Alle-Jan van der Veen (August 16, 2000). "Radio astronomical imaging in the presence of strong radio interference". IEEE Transactions on Information Theory. 46 (5): 1730–1747. <a href="ArXiv_(identifier)" class="mw-redirect" title="ArXiv (identifier)">arXiv</a>:<a rel="nofollow" class="external text" href="https://arxiv.org/abs/astro-ph/0008239">astro-ph/0008239</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2F18.857787">10.1109/18.857787</a>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:4671806">4671806</a>.</cite>

</li>

<li id="cite_note-14"><a href="#cite_ref-14">^</a> <cite id="CITEREFAmir_LeshemAlbert-Jan_BoonstraAlle-Jan_van_der_Veen2000" class="citation journal cs1">Amir Leshem; Albert-Jan Boonstra; Alle-Jan van der Veen (November 2000). "Multichannel Interference Mitigation Techniques in Radio Astronomy". Astrophysical Journal Supplement Series. 131 (1): 355–373. <a href="ArXiv_(identifier)" class="mw-redirect" title="ArXiv (identifier)">arXiv</a>:<a rel="nofollow" class="external text" href="https://arxiv.org/abs/astro-ph/0005359">astro-ph/0005359</a>. <a href="Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2000ApJS..131..355L">2000ApJS..131..355L</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1086%2F317360">10.1086/317360</a>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:50311217">50311217</a>.</cite>

</li>

</ol></div></div>

<div class="mw-heading mw-heading2"><h2 id="Sources">Sources</h2></div>

<ul><li><cite id="CITEREFJohnsonDudgeon1993" class="citation book cs1">Johnson, D. H.; Dudgeon, D. E. (1993). Array Signal Processing. Prentice Hall.</cite></li>

<li><cite id="CITEREFVan_Trees2002" class="citation book cs1">Van Trees, H. L. (2002). Optimum Array Processing. New York: Wiley.</cite></li>

<li><cite id="CITEREFKrimViberg1996" class="citation journal cs1">Krim, H.; Viberg, M. (July 1996). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20130909011148/http://www.vissta.ncsu.edu/publications/ahk/spm1996.pdf">"Two Decades of Array Signal Processing Research"</a> (PDF). IEEE Signal Processing Magazine: 67–94. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2F79.526899">10.1109/79.526899</a>. Archived from <a rel="nofollow" class="external text" href="http://www.vissta.ncsu.edu/publications/ahk/spm1996.pdf">the original</a> (PDF) on 9 September 2013. Retrieved 8 December 2010.</cite></li>

<li>S. Haykin and K.J.R. Liu (Editors), "Handbook on Array Processing and Sensor Networks", Adaptive and Learning Systems for Signal Processing, Communications, and Control Series, 2010.</li>

<li>E. Tuncer and B. Friedlander (Editors), "Classical and Modern Direction-of-Arrival Estimation", Academic Press, 2010.</li>

<li>A.B. Gershman, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20110719095745/http://www.nts.tu-darmstadt.de/nt/fileadmin/nas/lehre/SS_08/PS_Smart_Antennas/slides_proj_sem.pdf">array processing courseware</a></li>

<li>Prof. J.W.R. Griffiths, Adaptive array processing, IEEPROC, Vol. 130,1983.</li>

<li>N. Petrochilos, G. Galati, E. Piracci, Array processing of SSR signals in the multilateration context, a decade survey.</li></ul></div><div><div class="zim-footer">

This article is issued from <a class="external text" title="Last edited on 2025-07-24" href="https://en.wikipedia.org/wiki/?title=Array_processing&oldid=1302202860">Wikipedia</a>. The text is available under <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Creative Commons Attribution-Share Alike 4.0</a> unless otherwise noted. Additional terms may apply for the media files.

</div>

</div></div>

</div>

</main>

</div>

</body></html>